Proceedings of the Eighth International Workshop on Graph Transformation and Visual Modeling Techniques ( GT - VMT 2009 )
نویسندگان
چکیده
Model transformations are a key concept for modular and distributed model driven development. In this context, triple graph grammars have been investigated and applied to several case studies and they show a convenient combination of formal and intuitive specification abilities. Especially the automatic derivation of forward and backward transformations out of just one specified set of rules for the integrated model simplifies the specification and enhances usability as well as consistency. Since negative application conditions (NACs) are key ingredient for many model transformations based on graph transformation we embed them in the concept of triple graph grammars. As a first main result we can extend the composition/decomposition result for triple graph grammars to the case with NACs. This allows us to show completeness and correctness of model transformations based on rules with NACs and furthermore, we can extend the characterization of information preserving model transformations to the case with NACs. The presented results are applicable to several model transformations and in particular to the well known model transformation from class diagrams to relational data bases, which we present as running example with NACs.
منابع مشابه
Supporting Model-to-Model Transformations: The VMT Approach
The model-driven architecture approach (MDA) promotes software development as driven by a thorough modeling phase where application code is automatically generated from a platform specific UML model (PSM). The idea is that the PSM is itself derived from a platform independent UML model (PIM). Such code generation and model derivation are examples of model-to-model transformations. This paper pr...
متن کاملPre-Proceedings GT-VMT 2007
Bisimilarity is the most widespread notion of behavioral equivalence and hence algorithms for bisimulation checking are of fundamental importance for verifying that two systems are behaviorally equivalent (seen from the perspective of the environment). We investigate this problem in the context of behavioral equivalences of graphs and graph transformation systems, where the extension of the DPO...
متن کاملPattern composition in graph transformation rules
Graph transformation (GT) frequently serves as a precise underlying specification mechanism for model transformations within and between modeling languages. However, composability of graph transformation rules is typically limited to inter-level rule composition (i.e. rules calling other rules). In the current paper, we introduce intra-level composition for GT rules where the left-hand side and...
متن کاملWorkshop on Graph Transformation and Visual Modeling Techniques
9:1510:30 Symbolic Attributed Graphs and Attributed Graph Transformation Abstract In this talk we will present a new approach to deal with attributed graphs and attributed graph transformation. The approach is based on working with what we call symbolic graphs, which are graphs labelled with variables together with formulas that constrain the possible values that we may assign to these variable...
متن کاملSaying Hello World with VIATRA2 - A Solution to the TTC 2011 Instructive Case
Automated model transformations play an important role in modern model-driven system engineering in order to query, derive and manipulate large, industrial models. Since such transformations are frequently integrated into design environments, they need to provide short reaction time to support software engineers. The objective of the VIATRA2 (VIsual Automated model TRAnsformations [9]) framewor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009